package com.singzi.leetcode.N100;

public class T0045 {
    public static void main(String[] args) {
        int []nums = {1,1,1,1};
        Solution0045 solution0045 = new Solution0045();
        System.out.println(solution0045.jump(nums));
    }
}

class Solution0045 {
    public int jump(int[] nums) {

        if(nums.length == 1) return 0;
        if(nums.length == 2) return 1;
        if(nums[0]>=nums.length-1) return 1;

        int index=0;


        return 0;

    }
}